Boundaries of quantum supremacy via random circuit sampling

Abstract Google’s quantum supremacy experiment heralded a transition point where computers can evaluate computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on region of advantage for circuits with larger number qubits and gates experimentally implemented. At near-term gate fidelities, we demonstrate that is limited to qubit count depth few hundred. Larger encounter two distinct boundaries: return practically infeasible runtimes. Decreasing error rates cause grow rapidly. required early implementations surface code, largest size within regime coincides approximately smallest needed implement correction. Thus, boundaries may fortuitously coincide advent scalable, error-corrected computing.